Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
f(f(f(a,x),y),z) |
→ f(f(x,z),f(y,z)) |
| 2: |
|
f(f(b,x),y) |
→ x |
| 3: |
|
f(c,y) |
→ y |
|
There are 3 dependency pairs:
|
| 4: |
|
F(f(f(a,x),y),z) |
→ F(f(x,z),f(y,z)) |
| 5: |
|
F(f(f(a,x),y),z) |
→ F(x,z) |
| 6: |
|
F(f(f(a,x),y),z) |
→ F(y,z) |
|
Consider the SCC {4-6}.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006